/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2024-04-27
 * Time: 11:25
 */
//1312.让字符串成为回文串的最少插入次数
class Solution6 {
    public int minInsertions(String s) {
        int n = s.length();
        //dp表示dp[i][j] 区间[i][j]子串使它成为回文子串的最小插入次数
        int[][] dp = new int[n][n];
        for(int i = n-1; i >= 0; i--) {
            for(int j = i+1; j < n; j++) {
                if(s.charAt(i) == s.charAt(j)) {
                    dp[i][j] = dp[i+1][j-1];
                }else {
                    dp[i][j] = Math.min(dp[i+1][j],dp[i][j-1])+1;
                }
            }
        }
        return dp[0][n-1];
    }
}
